On the Excedance Number of Colored Permutation Groups
نویسندگان
چکیده
We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of Sn with some natural parameters to the colored permutation group and to the Coxeter group of type D. We define two different orders on these groups which induce two different excedance numbers. Surprisingly, in the case of the colored permutation group, we get the same generalized formulas for both orders.
منابع مشابه
Recursions for Excedance Number in Some Permutations Groups
The excedance number for Sn is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups Gr,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity resul...
متن کاملStatistics on the Multi-Colored Permutation Groups
We define an excedance number for the multi-colored permutation group i.e. the wreath product (Zr1 × · · · ×Zrk) o Sn and calculate its multi-distribution with some natural parameters. We also compute the multi-distribution of the parameters exc(π) and fix(π) over the sets of involutions in the multi-colored permutation group. Using this, we count the number of involutions in this group having ...
متن کاملec 2 00 6 STATISTICS ON THE MULTI - COLORED PERMUTATION GROUPS
We define an excedance number for the multi-colored permutation group i.e. the wreath product Zr1 × · · ·×Zrk ≀Sn and calculate its multi-distribution with some natural parameters. We also compute the multi-distribution of the parameters exc(π) and fix(π) over the sets of involutions in the multi-colored permutation group. Using this, we count the number of involutions in this group having a fi...
متن کاملRecursions for Excedance Number in Some Permutations Groups
We present recursions for the number of excedances in Coxeter groups of type A and B, as well as in the colored permutation groups Zr ≀ Sn. The proofs use only computations of excedances.
متن کاملOn the Excedance Sets of Colored Permutations
We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006